Graph colouring algorithms
نویسنده
چکیده
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available techniques and is organized by algorithmic paradigm.
منابع مشابه
Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs
We design an O(m) algorithm to find a minimum weighted colouring and a maximum weighted clique of a perfectly ordered graph. We also present two O(n’) algorithms to find a minimum weighted colouring of a comparability graph and of a triangulated graph. Our colouring algorithms use an algorithm to find a stable set meeting all maximal (with respect to set inclusion) cliques of a perfectly ordere...
متن کاملComparing the Best Maximum Clique Finding Algorithms, Which are Using Heuristic Vertex Colouring
In this paper two best known at the moment algorithms for finding the maximum clique is compared. A key technique that both algorithms rely on is using a heuristic vertex colouring. The only difference between those algorithms is a way of using vertex-colouring and this difference in the very important. The algorithms’ approaches are divided in this paper into two classes: reapplying vertex col...
متن کاملIncreasing the Efficiency of Graph Colouring Algorithms with a Representation Based on Vector Operations
We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of graph colouring algorithms. Moreover, this model provides useful information to aid in the creation of heuristics that can make the colouring process even faster. It also serves as a compact definition for the description of graph colouring algorithms....
متن کاملGreedy Graph Colouring is a Misleading Heuristic
Let G = (V,E) be a (finite, simple, undirected) graph with vertex set V and edge set E. A clique in G is a set of vertices, each of which is adjacent to every other vertex in this set. The maximum clique problem is to find a largest such set in a given graph; this is NP-hard [GJ90]. We denote the size of a maximum clique by ω. A colouring of G is an assignment of vertices to colours such that n...
متن کاملExact Algorithms for Variants of Satisfiability and Colouring Problems
This dissertation studies exact algorithms for various hard problems and give an overview of not only results but also the techniques used. In the first part we focus on Satisfiability and several variants of Satisfiability. We present some historical techniques and results. Our main focus in the first part is on a particular variant of Satisfiability, Exact Satisfiability. Exact Satisfiability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1505.05825 شماره
صفحات -
تاریخ انتشار 2013